TripleEye: Mining Closed Itemsets with Minimum Length Thresholds Based on Ordered Inclusion Tree
نویسندگان
چکیده
منابع مشابه
Mining Closed Itemsets: A Review
Closed itemset mining is a popular research in data mining. It was proposed to avoid a large number of redundant itemsets in frequent itemset mining. Various algorithms were proposed with efficient strategies to generate closed itemsets. This paper aims to study the existence algorithms used to mine closed itemsets. The various strategies in the algorithms are presented and analyzed in this paper.
متن کاملEfficient Mining of High Average-Utility Itemsets with Multiple Minimum Thresholds
High average-utility itemsets mining (HAUIM) is a key data mining task, which aims at discovering high average-utility itemsets (HAUIs) by taking itemset length into account in transactional databases. Most of these algorithms only consider a single minimum utility threshold for identifying the HAUIs. In this paper, we address this issue by introducing the task of mining HAUIs with multiple min...
متن کاملFrequent Itemsets Mining with VIL - Tree Algorithm
The aim of this paper is to develop a new mining algorithm to mine all frequent itemsets from a transaction database called the vertical index list (VIL) tree algorithm. The main advantages of the previous algorithms, which are frequent pattern (FP) growth and inverted index structure (IIS) mine, are still useful in a new approach as database scanning only done once, and all frequent itemsets a...
متن کاملA Graph-Based Approach for Mining Closed Large Itemsets
Data Mining means a process of nontrivial extraction of implicit, previously and potentially useful information from data in databases. Mining closed large itemsets is a further work of mining association rules, which aims to find the set of necessary subsets of large itemsets that could be representative of all large itemsets. In this paper, we design a graph-based approach, considering the ch...
متن کاملMining frequent closed itemsets out-of-core
Extracting frequent itemsets is an important task in many data mining applications. When data are very large, it becomes mandatory to perform the mining task by using an external memory algorithm, but only a few of these algorithms have been proposed so far. Since also the result set of all the frequent itemsets is likely to be undesirably large, condensed representations, such as closed itemse...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IPSJ Online Transactions
سال: 2012
ISSN: 1882-6660
DOI: 10.2197/ipsjtrans.5.192